Careful Autonomous Agents in Environments With Multiple Common Resources

Careful rational synthesis was defined in (Condurache et al. 2021) as a quantitative extension of Fisman al.'s (Fisman 2010), model multi-agent systems which agents are interacting graph arena turn-based fashion. There is one common resource, and each action may decrease or increase the resource. Each agent has temporal qualitative objective wants to maintain value resource positive. One must find Nash equilibrium. This problem decidable. In more practical settings, verification critical properties calls for models with many resources. Indeed, robots consume produce than type resource: electric energy, fuel, raw material, manufactured goods, etc. We thus explore careful several show that undecidable. then propose variant bounded resources, motivated by observation storage resources limited. becomes decidable, no harder controller Linear-time Temporal Logic objectives.